Convergence Time Evaluation of Algorithms in MANETs
نویسندگان
چکیده
Since the advent of wireless communication, the need for mobile ad hoc networks has been growing exponentially. This has opened up a Pandora’s Box of algorithms for dealing with mobile ad hoc networks, or MANETs, as they are generally referred to. Most attempts made at evaluating these algorithms so far have focused on parameters such as throughput, packet delivery ratio, overhead etc. An analysis of the convergence times of these algorithms is still an open issue. The work carried out fills this gap by evaluating the algorithms on the basis of convergence time. Algorithms for MANETs can be classified into three categories: reactive, proactive, and hybrid protocols. In this project, we compare the convergence times of representative algorithms in each category, namely Ad hoc On-Demand Distance Vector (AODV)-reactive, Destination Sequence Distance Vector protocol (DSDV)-proactive, and Temporally Ordered Routing Algorithm (TORA)-hybrid. The algorithm performances are compared by simulating them in ns2. Tcl is used to conduct the simulations, while perl is used to extract data from the simulation output and calculate convergence time. The design of the experiments carried on is documented using Unified modeling Language. Also, a user interface is created using perl, which enables the user to either run a desired simulation and measure convergence time, or measure the convergence time of a simulation that has been run earlier. After extensive testing, it was found that the two algorithms AODV and DSDV are suited to opposite ends of the spectrum of possible scenarios. AODV was observed to outperform DSDV when the node density was low and pause time was high (sparsely populated very dynamic networks), while DSDV performed better when the node density was high and pause time was low (densely populated, relatively static networks). The implementation of TORA in ns2 was found to contain bugs, and hence analysis of TORA was not possible. Future enhancements include rectifying the bugs in TORA and performing convergence time analysis of TORA as well. Also, a system could be developed which can switch between protocols in real time if it is found that another protocol is better suited to the current network environment.
منابع مشابه
BeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms
Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...
متن کاملRouting Improvement for Vehicular Ad Hoc Networks (VANETs) Using Nature Inspired Algorithms
are a subset of MANETs in which vehicles are considered as network clients. These networks have been created to communicate between vehicles and traffic control on the roads. have similar features to MANETs and their main special property is the high-speed node mobility which makes a quick change of the network. The rapid change of network topology is a major challenge in routing. One of the we...
متن کاملComparative Performance Analysis of AODV,DSR, TORA and OLSR Routing Protocols in MANET Using OPNET
Mobile Ad Hoc Networks (MANETs) are receiving a significant interest and are becoming very popular in the world of wireless networks and telecommunication. MANETs consist of mobile nodes which can communicate with each other without any infrastructure or centralized administration. In MANETs, the movement of nodes is unpredictable and complex; thus making the routing of the packets challenging....
متن کاملDynamic anomaly detection by using incremental approximate PCA in AODV-based MANETs
Mobile Ad-hoc Networks (MANETs) by contrast of other networks have more vulnerability because of having nature properties such as dynamic topology and no infrastructure. Therefore, a considerable challenge for these networks, is a method expansion that to be able to specify anomalies with high accuracy at network dynamic topology alternation. In this paper, two methods proposed for dynamic anom...
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0910.1475 شماره
صفحات -
تاریخ انتشار 2009